Point Location in Dynamic Planar Subdivisions
نویسندگان
چکیده
We study the point location problem on dynamic planar subdivisions that allows insertions and deletions of edges. In our problem, the underlying graph of a subdivision is not necessarily connected. We present a data structure of linear size for such a dynamic planar subdivision that supports sublinear-time update and polylogarithmic-time query. Precisely, the amortized update time is O( √ n log n(log log n)) and the query time is O(log n(log log n)), where n is the number of edges in the subdivision. This answers a question posed by Snoeyink in the Handbook of Computational Geometry. When only deletions of edges are allowed, the update time and query time are just O(α(n)) and O(log n), respectively.
منابع مشابه
Dynamization of the Trapezoid Method for Planar Point Location Dynamization of the Trapezoid Method for Planar Point Location
We present a fully dynamic data structure for point location in a monotone sub division, based on the trapezoid method. The operations supported are insertion and deletion of vertices and edges, and horizontal translation of vertices. Let n be the current number of vertices of the subdivision. Point location queries take O(log n) time, while updates take O(log2 n) time. The space requirement i...
متن کاملI/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
We present improved and simplified i/o-efficient algorithms for two problems on planar lowdensity subdivisions, namely map overlay and point location. More precisely, we show how to preprocess a low-density subdivision with n edges in O(sort(n)) i/o’s into a compressed linear quadtree such that one can: (i) compute the overlay of two such preprocessed subdivisions in O(scan(n)) i/o’s, where n i...
متن کاملPoint Location in Disconnected Planar Subdivisions
Let G be a (possibly disconnected) planar subdivision and let D be a probability measure over R2. The current paper shows how to preprocess (G,D) into an O(n) size data structure that can answer planar point location queries over G. The expected query time of this data structure, for a query point drawn according to D, is O(H + 1), where H is a lower bound on the expected query time of any line...
متن کاملDynamization of the trapezoid method for planar point location in monotone subdivisions
We present a fully dynamic data structure for point location in a monotone subdivision , based on the trapezoid method. The operations supported are insertion and deletion of vertices and edges, and horizontal translation of vertices. Let n be the current number of vertices of the subdivision. Point location queries take O(log n) time, while updates take O(log 2 n) time (amortized for vertex in...
متن کاملI/o-eecient Dynamic Planar Point Location
We present the rst provably I/O-e cient dynamic data structure for point location in a general planar subdivision. Our structure uses O(N=B) disk blocks to store a subdivision of size N , where B is the disk block size. Queries can be answered in O(log2 B N) I/Os in the worst-case, and insertions and deletions can be performed in O(log B N) and O(log B N) I/Os amortized, respectively. Previousl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018